Method and device for multi-user detection with simplified de-correlation in a CDMA system

ABSTRACT

A simplified de-correlation method in CDMA multi-user detection comprises: a. receive wireless symbols S; b. obtain a channel correlation matrix R, take a part from R to get a partial correlation matrix R P ; c. do inversion operation to the partial correlation matrix R P , then obtain matrix V (m) ; d. recover original data symbols D from received symbols S by V (m)  that the location of original data symbols D corresponds to.

FIELD OF THE INVENTION

The invention relates to a de-correlation method and relative device in CDMA, especially relates to a simplified de-correlation method and relevant device in TD-SCDMA multi-user detection.

BACKGROUND OF THE INVENTION

Under the collective influence of channel multi-path dispersion, Inter-Symbol Interference and Multiple Access Interference, it becomes a key of that the multi-user detection is practical or not, that how to depress the complexity of the multi-user detection cancellation algorithm, namely the de-correlation method, to acceptable degree. A received symbol vector can be expressed as the sum of a noise vector and the product that a transmitted symbol vector D left multiply by a channel correlation matrix R. Among the algorithm of demodulating the received symbol vector and getting the estimation {circumflex over (D)} of the transmitted symbol, the most complex step is getting the inverse matrix R⁻¹ of the channel correlation matrix R. For example, usually existing technology adopts the following method: in downlink spreading factor is SF=16. Assuming there are K users in one time slot and 1≦K≦16, in each of the data part, there are K*N data symbols altogether, each user has N=22 data symbols. Let the n^(th) transmitted data symbols of all the K users be D ^((n))=(d ₁ ^((n)) , d ₂ ^((n)) , d ₃ ^((n)) , . . . d _(k) ^((n))), n=1, . . . , K  (1)

The symbol sequence of each user consists of N elements with intervals Ts. The elements are taken from a complex alphabet (1,j,−1,−j). Each data symbols of user K is multiplied by the user specific signature sequence. The specific signature sequence is expressed as: C ^((k))=(c ₁ ^((k)) , c ₂ ^((k)) , . . . , c _(Q) ^((k)))^(T) , k=1, . . . , K  (2)

Here [·]^(T) means vector/matrix transposition. The user specific signature sequence consists of Q chips at chip interval T c that is equal to Ts/Q. Each of the K channels is characterized by its discrete impulse response. The discrete impulse response of the k^(th) channel is expressed as: H ^((k))=(h ₁ ^((k)) , h ₂ ^((k)) , . . . , h _(w) ^((k)))^(T) , k=1, . . . , K  (3)

The discrete impulse response consists of W samples at chip rate interval Tc. The channel impulse response is assumed to be unchanged during one time slot.

It is very obviously that ISI arises when W>1, at one time, MAI arises due to channel distortion and non-orthogonal symbol C^((k)). The combined channel impulse response is defined by the convolution: B ^((k))=(b ₁ ^((k)) , b ₂ ^((k)) , . . . , b _(Q+W−1) ^((k)))^(T) =C ^((k)) *H ^((k)) , k=1, . . . ,K  (4)

The received sequence e is obtained at the chip rate. It is a sum of K sequences, each of length (N·Q+W−1), that are assumed to be arrive synchronously, perturbed by an noise sequence with same length: n=(n ₁ ,n ₂ , . . . , n _(N·Q+W−1))T  (5)

The received sequence can be written as e=(e ₁ , e ₂ , . . . e _(N·Q+W−1))^(T) =A·D+n  (6)

With transmitted data vector D=(D ⁽¹⁾ , D ⁽²⁾ , . . . , D ^((N)))^(T) ={d ₁ ⁽¹⁾ , d ₂ ⁽¹⁾ , . . . d _(K) ⁽¹⁾ , . . . d ₁ ^((n)) , d ₂ ^((n)) , . . . , d _(K) ^((n)) , . . . d ₁ ^((N)) , d ₂ ^((N)) , . . . ,d _(K) ^((N))}^(T)=(d ₁ , d ₂ , . . . , d _(KN))^(T)  (7)

Where d₁ ^((n)), d₂ ^((n)), . . . d_(k) ^((n)) is the n^(th) symbol of all the K users, and d _(j) ^(def) =d _(k) ^((n)) ; j=k+K·(n−1), k=1, . . . K, n=1 . . . N  (8)

With the matrix

$\begin{matrix} {{{{A = \left( a_{ij} \right)};{i = {1{\ldots\left( {{N \cdot Q} + W - 1} \right)}}}},{j = {1\mspace{11mu}\ldots\mspace{11mu}{K \cdot N}}}}{a_{{{Q{({n - 1})}} + 1},{k + {K{({n - 1})}}}} = \left\{ \begin{matrix} {B_{l}^{(k)},} & {{when}\left\{ \begin{matrix} {{{n = {1\mspace{14mu}\ldots\mspace{14mu} N}},{k = {1\mspace{11mu}\ldots\mspace{11mu} K}}}\;} \\ {1 = {1\mspace{11mu}\ldots\mspace{11mu}\left( {Q + W - 1} \right)}} \end{matrix} \right.} \\ {0,} & {other} \end{matrix} \right.}} & (9) \end{matrix}$

The received sequence e has to be processed to obtain a decision on the transmitted data symbol D under the assumption that the user-specific signature sequences C^((k)) and the channel cross-correlation H^((k)), k=1 . . . K are known at receivers.

At the same time zero-forcing method is used to eliminate MAI and ISI. It is based on minimizing ∥A{circumflex over (D)}−e∥²  (10)

Here {circumflex over (D)} is the estimation of transmitted symbols of all the K users. So {circumflex over (D)}=(A ^(H) A)⁻¹ A ^(H) e=D+(A ^(H) A)⁻¹ A ^(H) n  (11)

Here [·]^(H) means Hermit transposition and A^(H) e is the output of match filter, (A^(H)A)⁻¹A^(H)n is noise term. Above {circumflex over (D)} contains desired output D and noise, without MAT and ISI. Its covariance matrix δ²(A^(H)A)⁻¹ gives the correlation of the noise term. Generally, the variance of the noise term is more than the noise term which is obtained because of using match filter method. The SNR per-symbol at the output of the de-correlation is equal to γ(k, n)=1/δ²[(A ^(H) A)⁻¹]_(i,j) ; j=n+N·(k−1), k=1 . . . K, n=1 . . . N  (12)

Let R=A^(H)A  (13)

Then (Eq. 11) becomes {circumflex over (D)}=(R)⁻¹(RD+A ^(H) n)=D+(R)⁻¹ A ^(H) n  (14)

Because the difficulty exists in the matrix inversion operation of R, the calculation burden in TD-SCDMA system is bigger.

SUMMARY OF THE INVENTION

The invention wants to resolve the technical problem that provides a simplified de-correlation method to greatly reduce the complexity degree in multi-user detection calculation.

For resolving above problem, the invention adopts following technical project:

Provided de-correlation contains following steps:

-   -   a: Receive wireless symbols S;     -   b: Obtain a channel correlation matrix R, take one part from R         and get a partial correlation matrix R_(P);     -   c: Do inversion operation of the partial correlation matrix         R_(P) to obtain matrix V^((m));     -   d: Recover transmitted data symbols D respectively from received         symbols S according to V^((m)) that the corresponding location         of the transmitted data symbols D corresponds to.

The advice according to above method includes

-   -   relative calculation advice to define the partial correlation         matrix R_(P);     -   matrix inversion device and drawing out device to define new         matrix V^((m));     -   matrix-vector multiplication to multiply received wireless         symbols S by said matrix V^((m)), which are connect each with         other in turn.

Based on the character of channel correlation matrix, the invention has de-modulated only according to the inverse matrix of the diagonal partial matrix R_(p) of the correlation matrix R so as to reduce greatly the calculation in obtaining inverse matrix and reduce the loss of de-modulate performance. Assuming p=2, the most delay-time is 4 chips, multi-path is 4, when total users are 12, the performance is same as the un-simplified. Because the calculation complexity of the matrix with size M*M is directly proportional to the M³, so when P=22, N=22, the simplified inversion has only (5/22)³ times calculation complexity of the original un-simplified matrix inversion. This is quite a great reduction. Equally, in the symbol recover calculation, the complexity is also reduced to (5/22) of the original operation.

BRIEF DESCRIPTION OF THE DRAWING FIGURES

FIG. 1. is adopted advice according to the simplified de-correlation method of the invention.

DETAILED DESCRIPTION OF THE INVENTION

Original transmitted data symbol can be expressed as

-   D=[ . . . d₁ ^((n−p)), d₂ ^((n−p)), . . . , d_(k) ^((n−p)), . . . ,     d₁ ^((n)), d₂ ^((n)) . . . , d_(k) ^((n)) . . . , d₁ ^((n+p)), d₂     ^((n+p)), . . . ,d_(k)(n+p) . . . ]

Above d₁ ^((n−p)), d₂ ^((n−p)), . . . , d_(k) ^((n−p)) means (n−p)^(th) symbol of all K users. Above d₁ ^((n)), d₂ ^((n)) . . . , d_(k) ^((n)) means n^(th) symbol of all K users. Above d₁ ^((n+p)), d₂ ^((n+p)), . . . , d_(k) ^((n+p)) means (n+p)^(th) symbol of all K users.

Received symbol S can be expressed as

-   S=[ . . . ŝ₁ ^((n−p)), ŝ₂ ^((n−p)), . . . , ŝ_(k) ^(n−p)), . . . ,     ŝ₁ ^((n)), ŝ₂ ^((n)) . . . , ŝ_(k) ^((n)) . . . , ŝ₁ ^((n+p)), ŝ_(k)     ^((n+p)) . . . ]. Above ŝ₁ ^((n−p)), ŝ₂ ^((n−p)), . . . , ŝ_(k)     ^((n−p)) means (n−p)^(th) symbol of all K users. Above ŝ₁ ^((n)), ŝ₂     ^((n)) . . . , ŝ_(k) ^((n)) means n^(th) symbol of all K users.     Above ŝ₁ ^((n+p)), ŝ₂ ^((n+p)), . . . , ŝ_(k) ^((n+p)) means     (n+P)^(th) symbol of all K users. Let us define ŝ₁ ^((n)), ŝ₂ ^((n))     . . . , ŝ_(k) ^((n)) as S^((n)). Since the multi-path spread in     TD-SCDMA is assumed to be less than 12 chips, and the spreading     factor for downlink is 16, so there are no ISI from symbols more     than 2 symbols away. Also the MAI and ISI part from any particular     other user symbol is always much less than desired user symbol     amplitude. To recover D^((n))=d₁ ^((n)), d₂ ^((n)) . . . , d_(k)     ^((n)), influence from symbols in S^((t)) (t<n−p, or t>n+p) can be     neglected. It means D^((n)) can be recovered from received symbols -   S_(p) ^((n))=[ŝ₁ ^((n−p)), ŝ₂ ^((n−p)), . . . , ŝ_(k) ^((n−p)), . .     . , ŝ₁ ^((n)), ŝ₂ ^((n)) . . . , ŝ_(k) ^((n)) . . . , ŝ₁ ^((n+p)),     _(k) ^((n+p))]. Above ŝ₁ ^((n−p)), ŝ₂ ^((n−p)), . . . , ŝ_(k)     ^((n−p)) means (n−p)^(th) symbol of all K users. Above ŝ₁ ^((n)), ŝ₂     ^((n)) . . . , ŝ_(k) ^((n)) means n^(th) symbol of all K users.     Above ŝ₁ ^((n+p)), ŝ₂ ^((n+p)), . . . , ŝ_(k) ^((n+p)) means     (n+p)^(th) symbol of all K users. Assume P is large enough.

We here define a partial correlation matrix

-   R_(p)={r_(i,j)}, i,j=1 . . . (2P+1)K

Here r_(i,j) is the element of R in the i^(th) row and j^(th) column.

Define a new matrix V^((m))={v_(i,j) ^((m))}

-   v_(i,j) ^((m))=(R⁻¹ _(p))_(i+(m−1)K,j), i=1 . . . K, j=1 . . .     (2P+1)K, m=1 . . . 2P+1

Here R⁻¹ _(p) means matrix inversion. When P+1≦n≦N−P, D^((n)) can be recovered as {circumflex over (D)}^((n))=V^((P+1))S_(p) ^((n)).

{circumflex over (D)}^((n)) is the estimation of transmitted symbol. When n≦P, i.e. the interference symbol before D^((n)) is less than P, D^((n)) can be recovered as

-   {circumflex over (D)}^((n))=V^((n))S_(p) ^((n)).

Here S_(p) ^((n)) is defined as

-   S_(p) ^((n))=[ŝ₁ ⁽¹⁾, ŝ₂ ⁽¹⁾, . . . , ŝ_(K) ⁽¹⁾, . . . , ŝ₁ ^((n)),     ŝ₂ ^((n)) . . . , ŝ_(K) ^((n)) . . . , ŝ₁ ^((2P+1)), ŝ_(K)     ^((2P+1))].

Above ŝ₁ ⁽¹⁾, ŝ₂ ⁽¹⁾, . . . , ŝ_(k) ⁽¹⁾ is first symbol of all K users. Above ŝ₁ ^((n)), ŝ₂ ^((n)) . . . , ŝ_(k) ^((n)) is n^(th) symbol of all K users. Above ŝ₁ ^((2P+1)), ŝ₂ ^((2P+1)), . . . , ŝ_(k) ^((2P+1)) is 2P+1^(th) symbol of all K users.

When n≧N+1−P, and the interference symbols after D^((n)) is less P, D^((n)) can be recovered as

-   {circumflex over (D)}^((n))=V^((2P+1+n−N))S_(p) ^((n)).

Here S_(p) ^((n)) is defined as

-   S_(p) ^((n))=[ŝ₁ ^((N−2P)), ŝ₂ ^((N−2P)), . . . , ŝ_(k) ^((N−2P)), .     . . , ŝ₁ ^((n)),ŝ₂ ^((n)) . . . , ŝ_(k) ^((n)) . . . , ŝ₁ ^((N), ŝ)     ₂ ^((N)), . . . , ŝ_(k) ^((N))].

Above ŝ₁ ^((N−2P)), ŝ₂ ^((N−2P)), . . . , ŝ_(K) ^((N−2P)) is N−2P^(th) symbol of all K users. Above ŝ₁ ^((n)), ŝ₂ ^((n)) . . . , ŝ_(K) ^((n)) is n^(th) symbol of all K users. Above ŝ₁ ^((N)), ŝ₂ ^((N)), . . . , ŝ_(K) ^((N))], is N^(th) symbol of all K users.

In addition, the simplified de-correlation method can be named as partial de-correlation whose meaning is that use de-correlation method to eliminate the influence of the symbols which are earlier or later than the current on current symbols only according to P group of symbols which are earlier or later than current symbols.

FIG. 1 is the structure sketch map of the adopted advice according to the simplified de-correlation method.

It includes K match filters 1, K buffer storage 2 which are correspondingly connected with K match filters, relative calculation device 3 to define partial correlation matrix R_(p), matrix inversion device 4 and drawing out device 5 which tag after the relative calculation device to define new matrix V^((m)). The output of the mentioned buffer storage 2 and the output of the drawing out device 3 are connected with the input of the matrix-vector multiplication 6.

The mentioned baseband symbols of K users respectively are inputted to K match filters 1 and K buffer storage 2 to get received symbol S_(p) ^(n). 1 and 2 are connected with each other correspondingly The mentioned user signature sequence C^((k))=(c₁ ^((k)),c₂ ^((k)), . . . C_(Q) ^((k)))^(T), channel impulse response H⁽¹⁾,H⁽²⁾, . . . ,H^((k)), channel specific multiplication factor is respectively inputted to the relative calculation device 3 to obtain partial correlation matrix, then obtain the inverse matrix V of matrix R_(p) through matrix inversion device 4 and drawing out device 5, and draw out partial matrix V^((m)) from it. Through matrix vector multiplication 6 symbol estimation value {circumflex over (D)}^((n)) can be obtained from mentioned received symbol S_(p) ^((n)) and V^((m)).

The present invention is not restricted to above advice and method, so all the technical changes known by ordinary technician of the present fields should fall into the protective scope of the present invention. 

1. A simplified de-correlation method in TD-SCDMA multi-user detection comprising: receiving wireless symbols S; obtaining a channel correlation matrix R, taking one part from the channel correlation matrix R and getting a partial correlation matrix R_(P) of the channel correlation matrix R; performing an inversion operation to the partial correlation matrix R_(P), and then obtaining a matrix V^((m)) using an inverse version of the partial correlation matrix R_(P); and recovering original data symbols D from the received symbols S using the matrix V^((m)).
 2. A simplified de-correlation method in TD-SCDMA multi-user detection of claim 1, wherein said partial correlation matrix R_(P)={r_(i,j)}, i,j=1 . . . (2P+1)K, where said partial correlation matrix R_(P) is a submatrix of the channel correlation matrix R on diagonal, said K is the user number in one time slot, and said P is the symbols number earlier than or latter than current symbols and have influence to current symbols.
 3. A simplified de-correlation method in TD-SCDMA multi-user detection of claim 2, wherein said V^((m))={v_(i,j) ^((m))}, where v_(i,j) ^((m))=(R_(P) ⁻¹)_(i+(m−1)K,j), i =1. . . K,j=1. . . (2P+1)K,m=1 . . . 2P+1.
 4. A simplified de-correlation method in TD-SCDMA multi-user detection of claim 2, wherein 1≦K≦16.
 5. A simplified de-correlation method in TD-SCDMA multi-user detection of claim 1, wherein the location of original data symbols D have three situations: 1) when 1≦n≦P, V^((m))=V^((n)), D^((n)) can be recovered as {circumflex over (D)}^((n))=V^((n))S_(P) ^((n)) 2) when P+1≦n≦N−P, V^((m))=V^((P+1)), D^((n)) can be recovered as {circumflex over (D)}^((n))=V^((P+1))S_(P) ^((n)) 3) when N+1−P≦n≦N, V^((m))=V^((2P+1+n−N)), D^((n)) can be recovered as {circumflex over (D)}^((n))=V^((2P+1+n−N))S_(P) ^((n)), said {circumflex over (D)}^((n)) is the estimation of original symbol, said n is location of chip.
 6. A simplified de-correlation method in TD-SCDMA multi-user detection of claim 5, wherein said P is an integer and said N is
 22. 7. A simplified de-correlation method in TD-SCDMA multi-user detection of claim 6, wherein said P is
 2. 8. A simplified de-correlation method in TD-SCDMA multi-user detection of claim 1, wherein: When P+1≦n≦N−P, received wireless symbols S can be defined as ${S_{P}^{(n)} = \left( {\underset{\underset{n - {P^{th}{symbols}\mspace{14mu}{of}\mspace{14mu}{all}\mspace{14mu} K\mspace{14mu}{users}}}{︸}}{{\overset{\Cap}{s}}_{1}^{({n - P})},{\overset{\Cap}{s}}_{2}^{({n - P})},\ldots\mspace{11mu},{\overset{\Cap}{s}}_{K}^{({n - P})}},\ldots\mspace{11mu},\underset{\underset{n^{th}{symbols}\mspace{14mu}{of}\mspace{14mu}{all}\mspace{14mu} K\mspace{14mu}{users}}{︸}}{{\overset{\Cap}{s}}_{1}^{(n)},{\overset{\Cap}{s}}_{2}^{(n)},\ldots\mspace{11mu},{\overset{\Cap}{s}}_{K}^{(n)}},\ldots\mspace{11mu},\underset{\underset{n + {P^{th}{symbols}\mspace{14mu}{of}\mspace{14mu}{all}\mspace{14mu} K\mspace{14mu}{users}}}{︸}}{{\overset{\Cap}{s}}_{1}^{({n + P})},{\overset{\Cap}{s}}_{2}^{({n + P})},\ldots\mspace{11mu},{\overset{\Cap}{s}}_{K}^{({n + P})}}} \right)},$ where said Ŝ₁ ^((n−P)), Ŝ₂ ^((n−P)), . . . , Ŝ_(K) ^((n−P)) is (n−P)^(th) symbols of all K users, said Ŝ₁ ^((n)), Ŝ₂ ^((n)), . . . , Ŝ_(K) ^((n)) is (n)^(th) symbols of all K users, said Ŝ₁ ^((n+P)), Ŝ₂ ^((n+P)), . . . , Ŝ_(K) ^((n+P)) is (n+P)^(th) symbols of all K users; When 1≦n≦P, received wireless symbols S can be defined as ${S_{P}^{(n)} = \left( {\underset{\underset{1^{st}\mspace{20mu}{symbols}\mspace{14mu}{of}\mspace{14mu}{all}\mspace{14mu} K\mspace{14mu}{users}}{︸}}{{\overset{\Cap}{s}}_{1}^{(1)},\;{\overset{\Cap}{s}}_{2}^{(1)},\;\ldots\mspace{11mu},\;{\overset{\Cap}{s}}_{K}^{(1)}},\;\ldots\mspace{11mu},\;\underset{\underset{n^{th}\mspace{14mu}{symbols}\mspace{14mu}{of}\mspace{14mu}{all}\mspace{14mu} K\mspace{14mu}{users}}{︸}}{{\overset{\Cap}{s}}_{1}^{(n)},\;{\overset{\Cap}{s}}_{2}^{(n)},\;\ldots\mspace{11mu},\;{\overset{\Cap}{s}}_{K}^{(n)}},\;\ldots\mspace{11mu},\;\underset{\underset{{2P} + {1^{th}\;{symbols}\mspace{14mu}{of}\mspace{14mu}{all}\mspace{14mu} K\mspace{14mu}{users}}}{︸}}{{\overset{\Cap}{s}}_{1}^{({{2\; P} + 1})},\;{\overset{\Cap}{s}}_{2}^{({{2P} + 1})},\;\ldots\mspace{11mu},\;{\overset{\Cap}{s}}_{K}^{({{2P} + 1})}}} \right)},$ where said Ŝ₁ ⁽¹⁾, Ŝ₂ ⁽¹⁾, . . . , Ŝ_(K) ⁽¹⁾ is 1^(th) symbols of all K users, said Ŝ₁ ^((n)), Ŝ₂ ^((n)), . . . , Ŝ_(K) ^((n)) is (n)^(th) symbols of all K users, said Ŝ₁ ^((2P+1)), Ŝ₂ ^((2P+1)), . . . , Ŝ_(K) ^((2P+1)) is 2P+1^(th) symbols of all K users; When N +1−P≦n≦N, received wireless symbols S can be defined as ${S_{P}^{(n)} = \left( {\underset{\underset{N - {2P^{th}\mspace{20mu}{symbols}\mspace{14mu}{of}\mspace{14mu}{all}\mspace{14mu} K\mspace{14mu}{users}}}{︸}}{{\overset{\Cap}{s}}_{1}^{({N - {2P}})},\mspace{11mu}{\overset{\Cap}{s}}_{2}^{({N - {2P}})},\mspace{11mu}\ldots\mspace{11mu},\mspace{11mu}{\overset{\Cap}{s}}_{K}^{({N - {2P}})}},\mspace{11mu}\ldots\mspace{11mu},\mspace{14mu}\underset{\underset{n^{th}\mspace{14mu}{symbols}\mspace{14mu}{of}\mspace{14mu}{all}\mspace{14mu} K\mspace{14mu}{users}}{︸}}{{\overset{\Cap}{s}}_{1}^{(n)},\mspace{11mu}{\overset{\Cap}{s}}_{2}^{(n)},\mspace{11mu}\ldots\mspace{11mu},\mspace{11mu}{\overset{\Cap}{s}}_{K}^{(n)}},\mspace{11mu}\ldots\mspace{11mu},\mspace{14mu}\underset{\underset{N^{th}\;{symbols}\mspace{14mu}{of}\mspace{14mu}{all}\mspace{14mu} K\mspace{14mu}{users}}{︸}}{{\overset{\Cap}{s}}_{1}^{(N)},\mspace{11mu}{\overset{\Cap}{s}}_{2}^{(N)},\mspace{11mu}\ldots\mspace{11mu},\mspace{11mu}{\overset{\Cap}{s}}_{K}^{(N)}}} \right)},$ where said Ŝ₁ ^((N−2P)), Ŝ₂ ^((N−2P)), . . . , Ŝ_(K) ^((N−2P)) is N−2P^(th) symbols of all K users, said Ŝ₁ ^((n)), Ŝ₂ ^((n)), . . . , Ŝ_(K) ^((n)) is n^(th) symbols of all K users, said Ŝ₁ ^((N)), Ŝ₂ ^((N)), . . . , Ŝ_(K) ^((N)) is N^(th) symbols of all K users.
 9. A UE system in TD-SCDMA comprising: a correspond calculate equipment to define a partial correlation matrix R_(P) of a channel correlation matrix R; a draw out and inversed matrix equipment to define new matrix V^((m)) using the partial correlation matrix R_(P); and a matrix-vector multiplication to multiply received wireless symbols S by said matrix V^((m)).
 10. A UE system in TD-SCDMA of claim 9 further comprising K matching filters and K buffer storages that are connected to said K matching filters one by one. 